Subsequence Containment by Involutions
نویسندگان
چکیده
منابع مشابه
Subsequence Containment by Involutions
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...
متن کامل2 S ep 2 00 4 Subsequence containment by involutions
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...
متن کاملPartition congruences by involutions
We present a general construction of involutions on integer partitions which enable us to prove a number of modulo 2 partition congruences. Introduction The theory of partitions is a beautiful subject introduced by Euler over 250 years ago and is still under intense development [2]. Arguably, a turning point in its history was the invention of the “constructive partition theory” symbolized by F...
متن کاملPolyominoes determined by involutions
A permutomino of size n is a polyomino determined by particular pairs (π1, π2) of permutations of length n, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n. In this paper we consider the class of convex permutominoes which are symmetric with respect to the diagonal x = y. We determine the number of these permutominoes according to the dimension and we characterize the class of permutations associated t...
متن کاملThe Number of Involutions with r Fixed Points and a Long Increasing Subsequence
A new summation theorem for Schur symmetric functions is given, over partitions with an upper bound on the largest part, and with respect to the number of columns of odd length in the Ferrers diagram of the partition. This allows us to deduce expressions for the number of involutions of n symbols with r fixed points, the largest increasing subsequence of which has length m. The most compact of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1911